Watching the watchman.
نویسنده
چکیده
e know that the risk of stroke is increased in patients with trial fibrillation (AF), presumably because stagnant blood ow within the left atrium leads to thrombus formation. mportantly, 90% of thrombi, when seen by echocardiograhy in patients with nonrheumatic AF, are located in the eft atrial appendage (LAA) (1,2). Standard treatment of atients with AF is anticoagulation with warfarin. If wararin is not tolerated, aspirin and possibly clopidogrel are sed. Despite such therapy, stroke still occurs in patients ith AF, and evaluation of alternative strategies to miniize thromboembolic risk makes sense.
منابع مشابه
Watchman routes for lines and line segments
Given a set L of non-parallel lines in the plane, a watchman route (tour) for L is a closed curve contained in the union of the lines in L such that every line is visited (intersected) by the route; we similarly define a watchman route (tour) for a connected set S of line segments. The watchman route problem for a given set of lines or line segments is to find a shortest watchman route for the ...
متن کاملApproximating Watchman Routes
Given a connected polygonal domain P , the watchman route problem is to compute a shortest path or tour for a mobile guard (the “watchman”) that is required to see every point of P . While the watchman route problem is polynomially solvable in simple polygons, it is known to be NP-hard in polygons with holes. We present the first polynomial-time approximation algorithm for the watchman route pr...
متن کاملOn The Watchman Route Problem and Its Related Problems
We propose to study the watchman route problem and its related problems. The watchman route problem asks a shortest closed path within a given polygon so that every point in the polygon is visible from at least one point on the path. We first discuss the watchman route problem for simple polygons, for polygonal domains, and for arrangements of lines and line segments. We then focus on a problem...
متن کاملWatchman routes in the presence of a pair of convex polygons
Given a set of polygonal obstacles in the plane, the shortest watchman route problem asks for a closed route from which each point in the exterior of the polygons is visible to some point along the route. This problem is known to be NP-hard and the development of an eecient approximation algorithm is still open. We present an O(n 2) time algorithm for computing the shortest watchman route for a...
متن کاملOn Computing Shortest External Watchman Routes for Convex Polygons
We study the relationship between the interior angles of a convex polygon and the lengths of external watchman routes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of the American College of Cardiology
دوره 49 13 شماره
صفحات -
تاریخ انتشار 2007